Distributed Algorithms for Robust Convex Optimization via the Scenario Approach
نویسندگان
چکیده
منابع مشابه
Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach
This paper proposes a parallel computing framework to distributedly solve robust convex optimization (RCO) when the constraints are affected by nonlinear uncertainty. To this end, we adopt a scenario approach by randomly sampling the uncertainty set. To facilitate the computational task, instead of using a single centralized processor to obtain a “global solution” of the scenario problem (SP), ...
متن کاملFully Distributed Algorithms for Convex Optimization Problems
We design and analyze a fully distributed algorithm for convex constrained optimization in networks without any consistent naming infrastructure. The algorithm produces an approximately feasible and near-optimal solution in time polynomial in the network size, the inverse of the permitted error, and a measure of curvature variation in the dual optimization problem. It blends, in a novel way, go...
متن کاملRobust Orbit Determination via Convex Optimization
Given the initial position and velocity of an object, such as a satellite in orbit around the Earth, it is possible to determine its position and velocity at any other time by integrating the equations of motion. This prediction method is called propagating. Specifying the position and velocity of the satellite at a specific time, called the epoch, is a common way of representing an orbit. In t...
متن کاملRobust quantum error correction via convex optimization.
We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity. We illustrate our theory num...
متن کاملAsynchronous Newton-Raphson Consensus for Robust Distributed Convex Optimization
A general trend in the development of distributed 1 convex optimization procedures is to robustify existing algo2 rithms so that they can tolerate the characteristics and condi3 tions of communications among real devices. This manuscript 4 follows this tendency by robustifying a promising distributed 5 convex optimization procedure known as Newton-Raphson 6 consensus. More specifically, we modi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2019
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2018.2828093